An efficient marshaling framework for distributed systems
Identifieur interne :
000195 ( PascalFrancis/Corpus );
précédent :
000194;
suivant :
000196
An efficient marshaling framework for distributed systems
Auteurs : Konstantin Popov ;
Vladimir Vlassov ;
Per Brand ;
Seif HaridiSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0191822
Descripteurs français
English descriptors
Abstract
An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2763 |
|---|
| A08 | 01 | 1 | ENG | @1 An efficient marshaling framework for distributed systems |
|---|
| A09 | 01 | 1 | ENG | @1 PaCT 2003 : parallel computing technologies : Nizhni Novgorod, 15-19 September 2003 |
|---|
| A11 | 01 | 1 | | @1 POPOV (Konstantin) |
|---|
| A11 | 02 | 1 | | @1 VLASSOV (Vladimir) |
|---|
| A11 | 03 | 1 | | @1 BRAND (Per) |
|---|
| A11 | 04 | 1 | | @1 HARIDI (Seif) |
|---|
| A12 | 01 | 1 | | @1 MALYSHKIN (Victor) @9 ed. |
|---|
| A14 | 01 | | | @1 Swedish Institute of Computer Science (SICS) @2 Kista @3 SWE @Z 1 aut. @Z 3 aut. |
|---|
| A14 | 02 | | | @1 Department of Microelectronics and Information Technology, Royal Institute of Technology @2 Kista @3 SWE @Z 2 aut. @Z 4 aut. |
|---|
| A20 | | | | @1 324-331 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-40673-5 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117798820300 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 9 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0191822 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org. |
|---|
| C02 | 01 | X | | @0 001D02B01 |
|---|
| C03 | 01 | X | FRE | @0 Système réparti @5 02 |
|---|
| C03 | 01 | X | ENG | @0 Distributed system @5 02 |
|---|
| C03 | 01 | X | SPA | @0 Sistema repartido @5 02 |
|---|
| C03 | 02 | X | FRE | @0 Réseau télécommunication @5 03 |
|---|
| C03 | 02 | X | ENG | @0 Telecommunication network @5 03 |
|---|
| C03 | 02 | X | SPA | @0 Red telecomunicación @5 03 |
|---|
| C03 | 03 | X | FRE | @0 Simultanéité informatique @5 04 |
|---|
| C03 | 03 | X | ENG | @0 Concurrency @5 04 |
|---|
| C03 | 03 | X | SPA | @0 Simultaneidad informatica @5 04 |
|---|
| C03 | 04 | X | FRE | @0 Internet @5 05 |
|---|
| C03 | 04 | X | ENG | @0 Internet @5 05 |
|---|
| C03 | 04 | X | SPA | @0 Internet @5 05 |
|---|
| C03 | 05 | X | FRE | @0 Stockage @5 11 |
|---|
| C03 | 05 | X | ENG | @0 Storage @5 11 |
|---|
| C03 | 05 | X | SPA | @0 Almacenamiento @5 11 |
|---|
| C03 | 06 | X | FRE | @0 Latence @5 12 |
|---|
| C03 | 06 | X | ENG | @0 Latency @5 12 |
|---|
| C03 | 06 | X | SPA | @0 Latencia @5 12 |
|---|
| C03 | 07 | X | FRE | @0 Paradigme @5 13 |
|---|
| C03 | 07 | X | ENG | @0 Paradigm @5 13 |
|---|
| C03 | 07 | X | SPA | @0 Paradigma @5 13 |
|---|
| C03 | 08 | X | FRE | @0 Implémentation @5 14 |
|---|
| C03 | 08 | X | ENG | @0 Implementation @5 14 |
|---|
| C03 | 08 | X | SPA | @0 Implementación @5 14 |
|---|
| C03 | 09 | X | FRE | @0 Réseau web @5 15 |
|---|
| C03 | 09 | X | ENG | @0 World wide web @5 15 |
|---|
| C03 | 09 | X | SPA | @0 Red WWW @5 15 |
|---|
| C03 | 10 | X | FRE | @0 Algorithme réparti @5 16 |
|---|
| C03 | 10 | X | ENG | @0 Distributed algorithm @5 16 |
|---|
| C03 | 10 | X | SPA | @0 Algoritmo repartido @5 16 |
|---|
| N21 | | | | @1 131 |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Parallel computing technologies. International conference @2 7 @3 Nizhni Novgorod RUS @4 2003-09-15 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0191822 INIST |
|---|
| ET : | An efficient marshaling framework for distributed systems |
|---|
| AU : | POPOV (Konstantin); VLASSOV (Vladimir); BRAND (Per); HARIDI (Seif); MALYSHKIN (Victor) |
|---|
| AF : | Swedish Institute of Computer Science (SICS)/Kista/Suède (1 aut., 3 aut.); Department of Microelectronics and Information Technology, Royal Institute of Technology/Kista/Suède (2 aut., 4 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2763; Pp. 324-331; Bibl. 9 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org. |
|---|
| CC : | 001D02B01 |
|---|
| FD : | Système réparti; Réseau télécommunication; Simultanéité informatique; Internet; Stockage; Latence; Paradigme; Implémentation; Réseau web; Algorithme réparti |
|---|
| ED : | Distributed system; Telecommunication network; Concurrency; Internet; Storage; Latency; Paradigm; Implementation; World wide web; Distributed algorithm |
|---|
| SD : | Sistema repartido; Red telecomunicación; Simultaneidad informatica; Internet; Almacenamiento; Latencia; Paradigma; Implementación; Red WWW; Algoritmo repartido |
|---|
| LO : | INIST-16343.354000117798820300 |
|---|
| ID : | 04-0191822 |
|---|
Links to Exploration step
Pascal:04-0191822
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An efficient marshaling framework for distributed systems</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0191822</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0191822 INIST</idno>
<idno type="RBID">Pascal:04-0191822</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000195</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An efficient marshaling framework for distributed systems</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Concurrency</term>
<term>Distributed algorithm</term>
<term>Distributed system</term>
<term>Implementation</term>
<term>Internet</term>
<term>Latency</term>
<term>Paradigm</term>
<term>Storage</term>
<term>Telecommunication network</term>
<term>World wide web</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système réparti</term>
<term>Réseau télécommunication</term>
<term>Simultanéité informatique</term>
<term>Internet</term>
<term>Stockage</term>
<term>Latence</term>
<term>Paradigme</term>
<term>Implémentation</term>
<term>Réseau web</term>
<term>Algorithme réparti</term>
</keywords><front><div type="abstract" xml:lang="en">An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2763</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>An efficient marshaling framework for distributed systems</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>PaCT 2003 : parallel computing technologies : Nizhni Novgorod, 15-19 September 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>POPOV (Konstantin)</s1>
</fA11><fA11 i1="02" i2="1"><s1>VLASSOV (Vladimir)</s1>
</fA11><fA11 i1="03" i2="1"><s1>BRAND (Per)</s1>
</fA11><fA11 i1="04" i2="1"><s1>HARIDI (Seif)</s1>
</fA11><fA12 i1="01" i2="1"><s1>MALYSHKIN (Victor)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA20><s1>324-331</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-40673-5</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117798820300</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>9 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0191822</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B01</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Système réparti</s0>
<s5>02</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Distributed system</s0>
<s5>02</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Sistema repartido</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Réseau télécommunication</s0>
<s5>03</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Telecommunication network</s0>
<s5>03</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Red telecomunicación</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>04</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>04</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Internet</s0>
<s5>05</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Internet</s0>
<s5>05</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Internet</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Stockage</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Storage</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Almacenamiento</s0>
<s5>11</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Latence</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Latency</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Latencia</s0>
<s5>12</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Paradigme</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Paradigm</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Paradigma</s0>
<s5>13</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Implémentation</s0>
<s5>14</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Implementation</s0>
<s5>14</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Implementación</s0>
<s5>14</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Réseau web</s0>
<s5>15</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>World wide web</s0>
<s5>15</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Red WWW</s0>
<s5>15</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>Algorithme réparti</s0>
<s5>16</s5>
</fC03><fC03 i1="10" i2="X" l="ENG"><s0>Distributed algorithm</s0>
<s5>16</s5>
</fC03><fC03 i1="10" i2="X" l="SPA"><s0>Algoritmo repartido</s0>
<s5>16</s5>
</fC03><fN21><s1>131</s1>
</fN21><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Parallel computing technologies. International conference</s1>
<s2>7</s2>
<s3>Nizhni Novgorod RUS</s3>
<s4>2003-09-15</s4>
</fA30><server><NO>PASCAL 04-0191822 INIST</NO>
<ET>An efficient marshaling framework for distributed systems</ET>
<AU>POPOV (Konstantin); VLASSOV (Vladimir); BRAND (Per); HARIDI (Seif); MALYSHKIN (Victor)</AU>
<AF>Swedish Institute of Computer Science (SICS)/Kista/Suède (1 aut., 3 aut.); Department of Microelectronics and Information Technology, Royal Institute of Technology/Kista/Suède (2 aut., 4 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2763; Pp. 324-331; Bibl. 9 ref.</SO>
<LA>Anglais</LA>
<EA>An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.</EA>
<CC>001D02B01</CC>
<FD>Système réparti; Réseau télécommunication; Simultanéité informatique; Internet; Stockage; Latence; Paradigme; Implémentation; Réseau web; Algorithme réparti</FD>
<ED>Distributed system; Telecommunication network; Concurrency; Internet; Storage; Latency; Paradigm; Implementation; World wide web; Distributed algorithm</ED>
<SD>Sistema repartido; Red telecomunicación; Simultaneidad informatica; Internet; Almacenamiento; Latencia; Paradigma; Implementación; Red WWW; Algoritmo repartido</SD>
<LO>INIST-16343.354000117798820300</LO>
<ID>04-0191822</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000195 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000195 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0191822
|texte= An efficient marshaling framework for distributed systems
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
